Improving Efficiency of Nearest Neighbor Search by Utilizing Spatial Inverted Index
نویسندگان
چکیده
منابع مشابه
An Approach to Improving Nearest Neighbor Search
In this paper, we present our research on data analysis and nearest neighbor search problems. A nearest neighbor search problem is normally described as finding data point or data points from a data set that are closest to a given query point. It is used in many research and industrial fields. In our paper, we propose an approach that explores the meaning of K nearest neighbors from a new persp...
متن کاملSearching of Nearest Neighbor Based on Keywords using Spatial Inverted Index
Many search engines are used to search anything from anywhere; this system is used to fast nearest neighbor search using keyword. Existing works mainly focus on finding top-k Nearest Neighbors, where each node has to match the whole querying keywords .It does not consider the density of data objects in the spatial space. Also these methods are low efficient for incremental query. But in intende...
متن کاملK-Nearest Neighbor Estimation of Forest Attributes: Improving Mapping Efficiency
—This paper describes our efforts in refining k-nearest neighbor forest attributes classification using U.S. Department of Agriculture Forest Service Forest Inventory and Analysis plot data and Landsat 7 Enhanced Thematic Mapper Plus imagery. The analysis focuses on FIA-defined forest type classification across St. Louis County in northeastern Minnesota. We outline three steps in the classifica...
متن کاملContinuous Nearest Neighbor Search
A continuous nearest neighbor query retrieves the nearest neighbor (NN) of every point on a line segment (e.g., “find all my nearest gas stations during my route from point s to point e”). The result contains a set of tuples, such that point is the NN of all points in the corresponding interval. Existing methods for continuous nearest neighbor search are based on the repetitiv...
متن کاملNearest Neighbor Search Algorithm
A fundamental activity common to image processing, pattern recognition, and clustering algorithm involves searching set of n , k-dimensional data for one which is nearest to a given target data with respect to distance function . Our goal is to find search algorithms with are full search equivalent -which is resulting match as a good as we could obtain if we were to search the set exhausting. 1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering & Technology
سال: 2018
ISSN: 2227-524X
DOI: 10.14419/ijet.v7i2.32.15729